# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def climbStairs(self, n: int) -> int:
        steps = [1, 2]
        dp = [0] * (n + 1)
        dp[0] = 1

        for i in range(n + 1):
            for j in range(2):
                if i >= steps[j]:
                    dp[i] += dp[i - steps[j]]

        return dp[-1]


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (2, 2),
        (3, 3)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果

        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.climbStairs(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

